The socle tableau as a dual version of the Littlewood–Richardson tableau

A Tableau for RTL (long version)

We use mosaics to provide a simple, sound, complete and terminating tableau reasoning procedure for the temporal logic of until and since over the real numbers model of time.

A Dual Tableau-based Decision Procedure for a Relational Logic with the Universal Relation (Extended Version)

We present a first result towards the use of entailment inside relational dual tableau-based decision procedures. To this end, we introduce a fragment of RL(1), called ({1,∪,∩} ; ), which admits a restricted form of composition, (R ;S) or (R ; 1), where the left subterm R of (R ; S) is only allowed to be either the constant 1, or a Boolean term neither containing the complement operator nor the...

Tableau Calculi for KLM Logics: extended version

We present tableau calculi for some logics of nonmonotonic reasoning, as defined by Kraus, Lehmann and Magidor. We give a tableau proof procedure for all KLM logics, namely preferential, loop-cumulative, cumulative and rational logics. Our calculi are obtained by introducing suitable modalities to interpret conditional assertions. We provide a decision procedure for the logics considered, and w...

The Tableau Browser SNARKSMathias

A Semantic Tableau Version of First-Order Quasi-Classical Logic

Quasi-classical logic (QC logic) allows the derivation of non-trivial classical inferences from inconsistent information. A paraconsis-tent, or non-trivializable, logic is, by necessity, a compromise, or weakening , of classical logic. The compromises on QC logic seem to be more appropriate than other paraconsistent logics for applications in computing. In particular, the connectives behave in ...